Q-Morph - Implementing a Quadrilateral Meshing Algorithm
نویسنده
چکیده
This thesis treats the implementational and some theoretical aspects of the Q-Morph algorithm for 2D domains. The main application areas are within FE methods. Q-Morph uses an advancing front method for generating unstructured, almost all-quadrilateral meshes containing at most one triangle, and few irregular nodes. The main algorithm is described in [16], while the post-processing methods are covered in [9, 4]. In addition to an introduction to the Q-Morph algorithm, the thesis also consists of some general background material for FEM meshing, discussions of many issues concerning the implementation, a presentation of important results, and a discussion of possible improvements. To ensure that the implementation conforms to the specifications of the algorithm, it has been tested on a number of different cases.
منابع مشابه
Transformation of a closed 3D triangular mesh to a quadrilateral mesh based on feature edges
In this paper, we propose a method of applying the Q-Morph to the closed three-dimensional triangular mesh. The Q-Morph is the method in order to transform the triangular mesh to the quadrilateral mesh. The Q-morph begins quadrilateral transformation from the initial front edges which are usually the boundary of the 2D domain. Also, the Q-Morph can be applied to the 3D domain. But, the closed 3...
متن کاملAutomated Two-Dimensional Multi-block Meshing Using the Medial Object
This paper describes the automatic generation of a structureddominant mesh based on an automatic block decomposition obtained using the medial object. The mesh generator will produce a mesh for an arbitrary two-dimensional geometry, where quadrilateral-dominant or triangular meshing is used when structured meshing fails. The domain is automatically partitioned into blocks (sub-regions), and an ...
متن کاملAlgorithms for Quadrilateral and Hexahedral Mesh Generation
This lecture reviews the state of the art in quadrilateral and hexahedral mesh generation. Three lines of development – block decomposition, superposition and the dual method – are described. The refinement problem is discussed, and methods for octree-based meshing are presented.
متن کاملLayTracks: a new approach to automated geometry adaptive quadrilateral mesh generation using medial axis transform
A new mesh generation algorithm called ‘LayTracks’, to automatically generate an all quad mesh that is adapted to the variation of geometric feature size in the domain is described. LayTracks combines the merits of two popular direct techniques for quadrilateral mesh generation—quad meshing by decomposition and advancing front quad meshing. While the MAT has been used for the domain decompositi...
متن کاملA Laguerre Voronoi Based Scheme for Meshing Particle Systems.
We present Laguerre Voronoi based subdivision algorithms for the quadrilateral and hexahedral meshing of particle systems within a bounded region in two and three dimensions, respectively. Particles are smooth functions over circular or spherical domains. The algorithm first breaks the bounded region containing the particles into Voronoi cells that are then subsequently decomposed into an initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002